Segment shared protection for survivable meshed WDM optical networks

نویسندگان

  • Lei Guo
  • Hongfang Yu
  • Lemin Li
چکیده

In this paper, we investigate the protection design for survivable meshed WDM optical networks, and propose a novel heuristic algorithm, which is called segment shared protection (SSP), to completely protect the dual-link failures. For each connection request, first SSP computes a least-cost working path, second SSP divides the working path into several un-overlapped segment paths according to a parameter M, and finally SSP computes two least-cost and linkdisjoint backup paths for each segment path. If two segment paths do not traverse the same fiber links, then their corresponding backup paths can shared the common reserved backup wavelengths. When computing the paths, we suggest two dynamic link-cost functions to adjust the resource sharing degree according to the current state of the network, and then our routing algorithm, which computes the least-cost paths, has higher resource utilization ratio and lower blocking ratio than those routing algorithms that merely compute the shortest paths. We describe our scheme of dividing the segment path and the method of assigning the reserved backup wavelengths. We also study the procedure of the protection switching time, which had not been studied by previous algorithms, for the dual-link failures, and calculate the formulas of the protection switching time. Under dynamic traffic with different load, the simulation results show that: SSP provides 100% reliable protection for the dual-link failures; with respect to the previous algorithm, SSP, adds a valuable elasticity between the resource utilization and the protection switching time, and is able to perform higher resource utilization ratio, lower blocking ratio, and faster protection switching time. 2005 Elsevier B.V. All rights reserved. PACS: 42.79.Sz; 42.81.Uv

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dynamic survivable algorithm for meshed WDM optical networks

In this paper, we propose a novel heuristic survivable algorithm called dynamic path-shared protection (DPSP) to completely protect the double-link failures in meshed Wavelengthdivision-multiplexing (WDM) optical networks. In order to improve the algorithm performance, we focus on considering two key issues that are load balancing and resourcesharing degree when computing the working and backup...

متن کامل

School of Computer Science Literature Review and Survey (0360-510, Fall 2006) Heuristics for Traffic Grooming in WDM Optical Networks with Shared Path Protection

The emergence of wavelength division multiplexing (WDM) technology has significantly increased the transmission capacity of a link in today's optical networks. In WDM networks, the bandwidth request of a traffic stream is usually much lower than the capacity of a wavelength. Traffic grooming can aggregate low-rate connections onto high-capacity optical fibers to make an efficient use of the ban...

متن کامل

Dynamic Provisioning of Survivable Multicast Sessions in Optical WDM Mesh Networks

We investigate dynamic provisioning of multicast sessions while protecting them against any single fiber cut in optical WDM mesh networks. Our proposed segment-protection and path-pair-protection schemes exhibit very good performance relative to other schemes.

متن کامل

Polynomial Time Algorithm (PTA) to generate a survivable ring virtual topology for Optical WDM based on the Hamiltonian Circuit Detection Heuristics(HCDH)

The Routing and Wavelength Assignment (RWA) problem is known to be NP-hard for general Physical Topology (PT) in optical networks. We have analyzed the survivability of the optical network under Survivable Routing and Shared Path Protection (SPP) for various topologies and suggested two survivable RWA algorithms which are shown to perform better under certain performance matrix by simulation. G...

متن کامل

A heuristic algorithm for shared segment protection in mesh WDM networks with limited backup path/segments length

This paper investigates the problem of dynamic survivable lightpath provisioning against single-link failure in optical mesh networks employingwavelength-divisionmultiplexing (WDM).We focus on the special problem of provisioning lightpath requests according to their differentiated protection-switching time, since lightpath may have different protection-switching time requirements. We assume tha...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005